methodology for safety stock placement in supply chain by using simulated annealing algorithm

نویسندگان

سید رضا موسوی طباطبائی

دانشگاه علم و صنعت ایران احمد ماکویی

دانشگاه علم و صنعت ایران

چکیده

in this paper, we introduce a methodology for safety stock placement in supply chain. the problem has two objectives: minimization of good's delivery time and inventory cost. because the problem belongs to np-hard category, we develop a proper simulated annealing algorithm (sa) for solve the proposed methodology in large scaled problem. for verify the performance and efficiency of the methodology is shown via a numerical example. the obtained results imply the efficiency of proposed methodology and the ability of developed simulated annealing algorithms for achieve to near optimal solution.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of Multi-Objective Model for Disruption Risk Assessment of Supply Chain Using Combined Genetic Algorithm and Simulated Annealing

Due to the many risks involved in the supply chain, and the high costs associated with damage to the supply chain, risk identification and evaluation should be a top priority in risk management programs in organizations. Risk assessment and ratings determine the superiority of each risk based on the relevant indicators and thus provide an appropriate response to each risk. In this regard, this ...

متن کامل

Markov Chain Anticipation for the Online Traveling Salesman Problem by Simulated Annealing Algorithm

The arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. The policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. In on-line created tours arc costs are not available for decision makers. The on-line traversed nodes are f...

متن کامل

Strategic Safety Stock Placement In Supply Chains

We consider a multi-stage production/distribution supply chain subject to stochastic demand. We formulate an optimization problem to determine where to place decoupling inventories, so-called strategic inventories, across the supply chain so as to minimize inventory holding costs subject to a service constraint for satisfying customer demand. We assume demand is normally distributed. For each s...

متن کامل

Placement by thermodynamic simulated annealing

Combinatorial optimization problems arise in different fields of science and engineering. There exist some general techniques coping with these problems such as simulated annealing (SA). In spite of SA success, it usually requires costly experimental studies in fine tuning the most suitable annealing schedule. In this Letter, the classical integrated circuit placement problem is faced by Thermo...

متن کامل

New model and heuristics for safety stock placement in general acyclic supply chain networks

We model the safety stock placement problem in general acyclic supply chain networks as a project scheduling problem, for which the constraint programming (CP) techniques are both effective and efficient in finding high quality solutions. We further integrate CP with a genetic algorithm (GA), which improves the CP solution quality significantly. The performance of our hybrid CP–GA algorithm is ...

متن کامل

markov chain anticipation for the online traveling salesman problem by simulated annealing algorithm

the arc costs are assumed to be online parameters of the network and decisions should be made while the costs of arcs are not known. the policies determine the permitted nodes and arcs to traverse and they are generally defined according to the departure nodes of the current policy nodes. in on-line created tours arc costs are not available for decision makers. the on-line traversed nodes are f...

متن کامل

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023